Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs

I/O-Optimal Algorithms for Outerplanar Graphs

We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing an separator of size O(1/ ) take O(scan(N)) I/Os on embedded outerplanar graphs. We also show that it takes O(sort(N)) I/Os to test whether a given graph is outerplanar and to compute an ...

External Memory Algorithms for Outerplanar Graphs

Transforming eulerian trails

Fleischner, H., G. Sabidussi and E. Wenger, Transforming eulerian trails, Discrete Mathematics 109 (1992) 103-116. In this paper a set of transformations (K-transformations) between eulerian trails is investigated. It is known that two arbitrary eulerian trails can be transformed into each other by a sequence of K-transformations. For compatible eulerran trails the set of K-transformations is a...

passivity in waiting for godot and endgame: a psychoanalytic reading

this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...

Algorithms for Drawing Plane Graphs

Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...